- modulo n function
- n.Modulo-N-Prüfziffernfunktion f.
English-german dictionary. 2013.
modulo n function
Schlagen Sie auch in anderen Wörterbüchern nach:
Modulo operation — Quotient (red) and remainder (green) functions using different algorithms. In computing, the modulo operation finds the remainder of division of one number by another. Given two positive numbers, a (the dividend) and n (the divisor), a modulo n… … Wikipedia
modulo — 1. preposition /ˈmɒdjʊləʊ/ a) Given a specified modulus of. 21 and 84 are congruent to each other modulo 9, since both numbers leave the same remainder, 3, when divided by 9. b) Except for differences accounted for by. Thus 21 modulo 9 is 3,… … Wiktionary
Euler's totient function — For other functions named after Euler, see List of topics named after Leonhard Euler. The first thousand values of φ(n) In number theory, the totient φ(n) of a positive integer n is defined to be the number of positive integers less than or equal … Wikipedia
Satisfiability Modulo Theories — (SMT) problem is a decision problem for logical formulas with respect to combinations of background theories expressed in classical first order logic with equality. Examples of theories typically used in computer science are the theory of real… … Wikipedia
Arithmetic function — In number theory, an arithmetic (or arithmetical) function is a real or complex valued function ƒ(n) defined on the set of natural numbers (i.e. positive integers) that expresses some arithmetical property of n. [1] An example of an arithmetic… … Wikipedia
Primitive root modulo n — In modular arithmetic, a branch of number theory, a primitive root modulo n is any number g with the property that any number coprime to n is congruent to a power of g (mod n ). That is, if g is a primitive root (mod n ) and gcd( a , n ) = 1,… … Wikipedia
Multiplicative group of integers modulo n — In modular arithmetic the set of congruence classes relatively prime to the modulus n form a group under multiplication called the multiplicative group of integers modulo n. It is also called the group of primitive residue classes modulo n. In… … Wikipedia
One-way function — Unsolved problems in computer science Do one way functions exist? In computer science, a one way function is a function that is easy to compute on every input, but hard to invert given the image of a random input. Here easy and hard are to be… … Wikipedia
Dirichlet L-function — In mathematics, a Dirichlet L series is a function of the form Here χ is a Dirichlet character and s a complex variable with real part greater than 1. By analytic continuation, this function can be extended to a meromorphic function on the whole… … Wikipedia
Igusa zeta-function — In mathematics, an Igusa zeta function is a type of generating function, counting the number of solutions of an equation, modulo p , p 2, p 3, and so on. Definition For a prime number p let K be a p adic field, i.e. [K: mathbb{Q} p] … Wikipedia
Carmichael function — In number theory, the Carmichael function of a positive integer n, denoted lambda(n),is defined as the smallest positive integer m such that:a^m equiv 1 pmod{n}for every integer a that is coprime to n.In other words, in more algebraic terms, it… … Wikipedia
